A Heuristic Approach Taking Operators’ Fatigue into Account for the Dynamic Assignment of Workforce to Reduce the Mean Flowtime
نویسندگان
چکیده
In order to cope with the frequent unpredictable changes that may occur in manufacturing systems, and to optimize given performance criteria, the assignment of workers can be decided online in a dynamic manner, whenever the worker is released. Several studies, in the ergonomics literature, have shown that individuals' performances decrease because of their fatigue in work. In manufacturing context, the workers’ fatigue impacts the task durations. Therefore, we propose to solve the online workers assignment problem through a heuristic, which takes this workers' fatigue into consideration, so as to minimize the mean flowtime of jobs. This approach suggests computing more realistic task duration in accordance with the worker's fatigue and it uses multi-criteria analysis in order to find a compromise to favor short durations and to avoid congestions. The Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method is used to select where to assign the worker. A learning process through simulation optimization is used to adapt the weights, in TOPSIS, to better fit with the system characteristics. The approach is illustrated with a simulated Job-Shop system. Experimental results comparing our approach with the rule Shortest Processing Time (SPT), which is known as efficient on the mean flowtime, show the effectiveness of the heuristic.
منابع مشابه
A Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملA genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem
Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملA New Heuristic Algorithm for Time-cost Trade-off Problem Taking into Account Monetary Value
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل